Proof theory

Results: 1637



#Item
591Proof theory / Propositional calculus / Deduction / Boolean algebra / Algebraic logic / Natural deduction / Heyting algebra / Sequent calculus / Negation / Logic / Mathematical logic / Mathematics

[hal, v1] Semantic A-translation and Super-consistency entail Classical Cut Elimination

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2014-01-28 09:59:08
592Sequent calculus / Mathematics / Deduction / Geometric group theory / Proof theory / Logic / Automated theorem proving

Encoding Zenon Modulo in Dedukti Olivier Hermant CRI, MINES ParisTech and Inria May 26, 2014

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2014-12-23 09:30:32
593Search algorithms / Computational complexity theory / Random oracle / Interactive proof system / Hash function / Zero-knowledge proof / Universal hashing / Collision resistance / Hash list / Cryptography / Cryptographic hash functions / Hashing

— A merged version of this work and the work of [DJKL12] appears in the proceedings of the Theory of Cryptography Conference - TCC 2013 — Why “Fiat-Shamir for Proofs” Lacks a Proof Nir Bitansky∗ Tel Aviv Univer

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-12-19 16:42:35
594Mathematics / Lambda calculus / Dependently typed programming / Logic in computer science / Proof theory / Natural deduction / Curry–Howard correspondence / Calculus of constructions / Type system / Type theory / Programming language theory / Theoretical computer science

The λΠ-calculus Modulo as a Universal Proof Language Mathieu Boespflug1 , Quentin Carbonneaux2 and Olivier Hermant3 1 2

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2012-07-25 10:49:31
595Complexity classes / Cryptographic protocols / Probabilistic complexity theory / Interactive proof system / Probabilistically checkable proof / IP / Soundness / Zero-knowledge proof / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

Unprovable Security of Two-Message Zero Knowledge Kai-Min Chung∗ Edward Lui∗ Mohammad Mahmoody∗ Rafael Pass∗ December 19, 2012

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-12-19 11:29:49
596Cryptographic protocols / Zero-knowledge proof / IP / NP / Commitment scheme / Randomized algorithm / Alice and Bob / Interactive proof system / Proof of knowledge / Theoretical computer science / Computational complexity theory / Cryptography

Precise Concurrent Zero Knowledge Omkant Pandey∗ Rafael Pass† Amit Sahai∗

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-02-01 05:01:22
597Cryptographic protocols / Zero-knowledge proof / Proof of knowledge / Non-interactive zero-knowledge proof / IP / ZK / Snark / NP / Mathematical proof / Theoretical computer science / Graph theory / Cryptography

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture Eli Ben-Sasson Alessandro Chiesa

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-05-09 17:46:15
598Computing / Lambda calculus / Program analysis / Type system / ParisTech / Normalisation by evaluation / Coq / Valuation / Programming language theory / Software engineering / Type theory

Dedukti: A Universal Proof Checker

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2013-12-10 11:27:57
599Theoretical computer science / Lambda calculus / Proof theory / Functional languages / Dependently typed programming / Higher-order abstract syntax / Dependent type / Judgment / Proof assistant / Programming language theory / Type theory / Mathematical logic

Dedukti: a Universal Proof Checker Ronan Saillard MINES ParisTech Context The success of formal methods both as tools of practical importance and as objects of intellectual curiosity, has spaw

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2013-06-14 08:53:53
600Type theory / Functional languages / Functional programming / Lisp programming language / Data types / Append / List / Cons / Dependent type / Software engineering / Computing / Declarative programming

Dedukti in a Nutshell Ronan Saillard MINES ParisTech Dedukti [1] is a proof checker based on rewriting and dependent types. It implements the λΠcalculus modulo, a very expressive logical fr

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2015-01-06 09:55:25
UPDATE